Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
*2(x, *2(minus1(y), y)) -> *2(minus1(*2(y, y)), x)
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
*2(x, *2(minus1(y), y)) -> *2(minus1(*2(y, y)), x)
Q is empty.
Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
*12(x, *2(minus1(y), y)) -> *12(minus1(*2(y, y)), x)
*12(x, *2(minus1(y), y)) -> *12(y, y)
The TRS R consists of the following rules:
*2(x, *2(minus1(y), y)) -> *2(minus1(*2(y, y)), x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
*12(x, *2(minus1(y), y)) -> *12(minus1(*2(y, y)), x)
*12(x, *2(minus1(y), y)) -> *12(y, y)
The TRS R consists of the following rules:
*2(x, *2(minus1(y), y)) -> *2(minus1(*2(y, y)), x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.